Decision Procedures in Automated Deduction
نویسنده
چکیده
of the Dissertation Decision Procedures in Automated Deduction
منابع مشابه
Unification procedures in automated deduction methods based on matings: A survey
Unification procedures arising in methods for automated theorem proving based on matings are surveyed. We begin by reviewing some fundamentals of automated deduction, including the Skolem form and the SkolemHerbrand-Gödel theorem. Next, the method of matings for first-order languages without equality due to Andrews and Bibel is presented. Standard unification is described in terms of transforma...
متن کاملCombining Shostak Theories
Ground decision procedures for combinations of theories are used in many systems for automated deduction. There are two basic paradigms for combining decision procedures. The Nelson–Oppen method combines decision procedures for disjoint theories by exchanging equality information on the shared variables. In Shostak’s method, the combination of the theory of pure equality with canonizable and so...
متن کاملBDDs and Automated Deduction
BDDs (binary decision diagrams) are a very succesful tool for handling boolean functions, but one which has not yet attracted the attention of many automated deduction specialists. We give an overview of BDDs from an automated deduction perspective, showing what can be done with them in propositional and first-order logic, and discuss the parallels to well-known methods like tableaux and resolu...
متن کاملOn the Complexity of Recursive Path Orderings
Well-founded orderings on terms are useful in a variety of contexts in computer science, not only in simply proving the termination of equationally defined algorithms, but also in automated deduction, for example in restrictions of paramodulation [2,6] and in rewriting systems (for an excellent survey on orderings and their use in rewriting see [4]). In these settings, decision procedures for v...
متن کاملChapter 14 B Model Checking and Deduction ( DRAFT ) ?
There are two basic approaches to automated verification. In model checking, the system is viewed as a graph representing possible execution steps. Properties are established by exploring or traversing the graph structure. In deduction, both the system and its putative properties are represented by formulas in a logic, and the resulting proof obligations are discharged by decision procedures or...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008